Parallel tree pattern matching

Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees

The following tree pattern matching problem is considered: Given two unordered labeled trees P and T , find all occurrences of P in T . Here P and T are called a pattern tree and a target tree, respectively. We first introduce a new problem called the pseudo-tree pattern matching problem. Then we show two efficient bit-parallel algorithms for the pseudo-tree pattern matching problem. One runs i...

Parallel Pattern Matching with Scaling

Bit-Parallel Multiple Pattern Matching

Text matching with errors is a regular task in computational biology. We present an extension of the bit-parallel Wu-Manber algorithm [16] to combine several searches for a pattern into a collection of fixed-length words. We further present an OpenCL parallelization of a redundant index on massively parallel multicore processors, within a framework of searching for similarities with seed-based ...

Unordered XML Pattern Matching with Tree Signatures

We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find qualifying patterns through integration of structurally consistent query path qualifications. An efficient technique is proposed and its implementation tested on real-life data collections.

Twig Pattern Matching on Tree Signatures

With the rapidly increasing popularity of XML for data representation, there is a lot of interest in query processing over data that conform to the labelled-tree data model. In this paper we deal with the three problems of pattern matching (path, ordered and unordered twig matching) by exploiting the tree signature approach [ZADR03], which has originally been proposed for the ordered tree match...